Bisimulations of enrichments

نویسندگان

  • Vincent Schmitt
  • Krzysztof Worytkiewicz
چکیده

In this paper we show that classical notions from automata theory such as simulation and bisimulation can be lifted to the context of enriched categories. The usual properties of bisimulation are nearly all preserved in this new context. The class of enriched functors that correspond to functionnal bisimulations surjective on objects is investigated and appears to be “very close” to be open in the sense of Joyal and Moerdijk [4]. Seeing the change of base techniques as a convenient means to define process refinement/abstractions we give sufficient conditions for the change of base categories to preserve bisimularity. We apply these concepts to Betti’s generalized automata, categorical transition systems, and other exotic categories.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Functional Bisimulations

Functional Bisimulations constitute a unifying framework for the equivalence of operational semantics and the correctness of implementations on an abstract machine. In the deterministic setting, functional bisimula-tions are in one-to-one correspondence to partial Lagois Connections with lower sets as domains of deenition. Unlike as for relational bisimulations in concurrency, functional bisimu...

متن کامل

Sound Bisimulations for Higher-Order Distributed Process Calculus

While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such systems modelled in the higher-order π-calculus with passivation (and restriction). Previous research for this calculus is limited to context bisimulations and nor...

متن کامل

A Calculus for True Concurrency

We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, τ laws for weakly truly concurrent bisimulations, and full congruen...

متن کامل

Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations

Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For that we show how to relate the underlying powerset and probabilistic distributions functors with the multiset functor by means of adequate natural transformations. This leads us to the general topic that we investigate in the pap...

متن کامل

Bisimulations for Temporal Logic Bisimulations for Temporal Logic

We define bisimulations for temporal logic with Since and Until. We compare our notion to existing notions of bisimulations, and we use it to develop the basic model theory of temporal logic with Since and Until, which includes preservation and definability' results. We conclude with a brief discussion of the wider applicabilitl' of our ideas.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0602077  شماره 

صفحات  -

تاریخ انتشار 2006